We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve the graph bisection problem approximately. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut sizes found by “local” algorithms becomes peaked as the number of vertices in the graphs becomes large. Evidence is given that this distribution tends toward a ...